import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Solution {
    public static String WriteOut(long n) {
        Map<String, String> map = new HashMap<>();
        map.put("1", "yi");
        map.put("2", "er");
        map.put("3", "san");
        map.put("4", "si");
        map.put("5", "wu");
        map.put("6", "liu");
        map.put("7", "qi");
        map.put("8", "ba");
        map.put("9", "jiu");
        int sum = 0;
        while (n > 0) {
            sum += n % 10;
            n = n / 10;
        }
        //整数转字符串数组，比如1234，要分为["1","2","3","4"]
        String[] strNum = String.valueOf(sum).split("");
        //获取映射关系
        String newStr = "";
        for (int i = 0; i < strNum.length; i++) {
            strNum[i] = map.get(strNum[i]);
            //拼音数字间有 1 空格，但一行中最后一个拼音数字后没有空格。
            if (i != strNum.length - 1) {
                strNum[i] = strNum[i] + " ";
                newStr += strNum[i];
            } else {
                newStr += strNum[i];
            }
        }
        return newStr;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            long n = in.nextLong();
            System.out.println(WriteOut(n));
        }
    }
}